On simultaneous planar graph embeddings
نویسندگان
چکیده
منابع مشابه
On Simultaneous Planar Graph Embeddings
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another in which the mapping is not given. We present positive and negative results for the two versions of the problem. Among the positive results with given mapping, we show that we can embed two paths on an n×...
متن کاملSimultaneous Geometric Graph Embeddings
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be placed in the plane in such a way that for each graph the straight-line drawing is planar. We partially settle an open problem of Erten and Kobourov [5] by showing that even for two graphs the problem is NP-hard. We also...
متن کاملMonotone Simultaneous Embeddings of Upward Planar Digraphs
We study monotone simultaneous embeddings of upward planar digraphs, which are simultaneous embeddings where the drawing of each digraph is upward planar, and the directions of the upwardness of different graphs can differ. We first consider the special case where each digraph is a directed path. In contrast to the known result that any two directed paths admit a monotone simultaneous embedding...
متن کاملSimultaneous Graph Embeddings with Fixed Edges
We study the problem of simultaneously embedding several graphs on the same vertex set in such a way that edges common to two or more graphs are represented by the same curve. This problem is known as simultaneously embedding graphs with fixed edges. We show that this problem is closely related to the weak realizability problem: Can a graph be drawn such that all edge crossings occur in a given...
متن کاملOn counting planar embeddings
A method for counting the embeddings of a connected but not necessarily biconnected planar graph is given. The method relates the embedding of edges around an articulation point to a tree structure called an embedding tree. MacLane [S] gives a method for counting the number of distinct embeddings of a biconnected planar graph. This method is based on a decomposition into triconnetted components...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2007
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2006.05.006